Codeword distinguishability in minimum diversity decoding
نویسندگان
چکیده
منابع مشابه
Codeword Distinguishability in Minimum Diversity Decoding
We re-take a coding-theoretic notion which goes back to Cl. Shannon: codeword distinguishability. This notion is standard in zero-error information theory, but its bearing is definitely wider and it may help to better understand new forms of coding, as we argue below. In our approach, the underlying decoding principle is very simple and very general: one decodes by trying to minimise the divers...
متن کاملOn random rotations diversity and minimum MSE decoding of lattices
We establish a simple relation between high diversity multidimensional rotations obtained from totally complex cyclotomic elds and the discrete Fourier transform. The diversity distribution of an Hadamard-like random rotation is derived analytically. It is shown that a random multidimensional rotation exhibits an excellent diversity distribution and can be combined to QAM constellations to comb...
متن کاملUniversal coding with minimum probability of codeword length overflow
-Lossless block-to-variable length source coding is studied for finite-state, finite-alphabet sources. We aim to minimize the probability that the normalized length of the codeword will exceed a given threshold B, subject to the Kraft inequality. It is shown that the Lempel-Ziv (LZ) algorithm asymptotically attains the optimal performance in the sense just defined, independently of the source a...
متن کاملMinimum Distance Decoding
Suppose we have a concatenated code where the outer code is an [N,K,D]Q code, and the inner code is an [n, k, d]q code, with Q = q. In section 4 we will see that the concatenated code is actually an [Nn,Kk, Dd]q code, but for now we will show the weaker property that it is an [Nn,Kk, Dd/2]q. Consider the näıve decoding procedure which uses the inner decoding scheme on each received symbol, then...
متن کاملMinimum Word Error Rate Decoding
From the theory of Bayesian pattern recognition it is well known that the maximum a posteriori decision criterion yields a recogniser with the minimum probability of assigning the incorrect label to a pattern, if the correct probability distributions are used. This MAP criterion is also routinely employed in automatic speech recognition system. The problem addressed in this thesis is the fact t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Mathematical Sciences and Cryptography
سال: 2006
ISSN: 0972-0529,2169-0065
DOI: 10.1080/09720529.2006.10698093